Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving
نویسندگان
چکیده
منابع مشابه
Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving
Recent developments in termination analysis for declarative programs emphasize the use of appropriate models for the logical theory representing the program at stake as a generic approach to prove termination of declarative programs. In this setting, Order-Sorted First-Order Logic provides a powerful framework to represent declarative programs. It also provides a target logic to obtain models f...
متن کاملOrder Sorted Quotient Algebra
Let R be a non empty poset. One can verify that there exists an order sorted set of R which is binary relation yielding. Let R be a non empty poset, let A, B be many sorted sets indexed by the carrier of R, and let I1 be a many sorted relation between A and B. We say that I1 is os-compatible if and only if the condition (Def. 1) is satisfied. (Def. 1) Let s1, s2 be elements of the carrier of R....
متن کاملFree Order Sorted Universal Algebra
In this paper S is an order sorted signature. Let S be an order sorted signature and let U0 be an order sorted algebra of S. A subset of U0 is called an order sorted generator set of U0 if: (Def. 1) For every OSSubset O of U0 such that O = OSCl it holds the sorts of OSGenO = the sorts of U0. The following proposition is true (1) Let S be an order sorted signature, U0 be a strict non-empty order...
متن کاملComputer Algebra Solving of First Order ODEs Using Symmetry Methods
A set of Maple V R.3/4 computer algebra routines for the analytical solving of 1 order ODEs, using Lie group symmetry methods, is presented. The set of commands includes a 1 order ODEsolver and routines for, among other things: the explicit determination of the coefficients of the infinitesimal symmetry generator; the construction of the most general invariant 1 order ODE under given symmetries...
متن کاملA Framework for Order-Sorted Algebra
Order-sorted algebra is a generalization of many-sorted algebra obtained by having a partially ordered set of sorts rather than merely a set. It has numerous applications in computer science. There are several variants of order sorted algebra, and some relationships between these are known. However there seems to be no single conceptual framework within which all the connections between the var...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2015
ISSN: 2075-2180
DOI: 10.4204/eptcs.200.3